The Assignment Problem and Its Relation to Logistics Problems

The assignment problem is a that takes many forms in optimization and graph theory, by changing some of the constraints or interpreting them differently adding other constraints, it can be converted to routing, distribution, scheduling problems. Showing such correlations one aims this paper. For derived problems having exponential time complexity, question arises their solvability for larger instances. Instead traditional approach based on use approximate stochastic heuristic methods, we focus here direct mixed integer programming models GAMS environment, which now capable solving instances much than past does not require complex parameter settings statistical evaluation results as case heuristics because computational core software tools, nested GAMS, deterministic nature. source codes presented may an aid tool yet well known MATLAB Optimisation Toolbox. Benchmarks permutation flow shop with informally MIP model traveling salesman are used present limits software’s applicability.